Automated and readable simplification of trigonometric expressions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated and readable simplification of trigonometric expressions

Automated simplification of trigonometric expressions is an important problem that hasn’t been completely solved by current computer algebra systems. This paper presents a number of unique prescriptions for the ordering of some trigonometric transformation rules, which have been derived by observing how human experts follow their intuitive rules. We have implemented the procedure in Lisp becaus...

متن کامل

Automated simplification of large symbolic expressions

We present a set of algorithms for automated simplification of constants of the form ∑ i αixi with αi rational and xi complex. The included algorithms, called SimplifySums and implemented in Mathematica, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the integer relation detection algorithm PSLQ. Also included are facil...

متن کامل

Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)

A trigonometric curve is a real plane curve where each coordinate is given parametri-cally by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can be also represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric repre...

متن کامل

Automated Simplification and Deduction

The commutative version of the Gröbner Basis Algorithm has become one of the most powerful tools in computer algebra. The recent adaptation of the algorithm to noncommuting variables has potential applications to matrix and operator expressions. A Forth-based research system was used to implement and study applications of a noncommutative variant of the Gröbner Basis Algorithm. It has been used...

متن کامل

Trigonometric Expressions for Fibonacci and Lucas Numbers

The amount of literature bears witness to the ubiquity of the Fibonacci numbers and the Lucas numbers. Not only these numbers are popular in expository literature because of their beautiful properties, but also the fact that they ‘occur in nature’ adds to their fascination. Our purpose is to use a certain polynomial identity to express these numbers in terms of trigonometric functions. It is in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2006

ISSN: 0895-7177

DOI: 10.1016/j.mcm.2006.04.002